Cluster-Based Load Balancing Algorithms for Grids

E-science applications may require huge amounts of data and high processing power where grid infrastructures are very suitable for meeting these requirements. The load distribution in a grid may vary leading to the bottlenecks and overloaded sites. We describe a hierarchical dynamic load balancing protocol for Grids. The Grid consists of clusters and each cluster is represented by a coordinator. Each coordinator first attempts to balance the load in its cluster and if this fails, communicates with the other coordinators to perform transfer or reception of load. This process is repeated periodically. We analyze the correctness, performance and scalability of the proposed protocol and show from the simulation results that our algorithm balances the load by decreasing the number of high loaded nodes in a grid environment.Comment: 17 pages, 11 figures; International Journal of Computer Networks, volume3, number 5, 201

Modelling Contiki-Based IoT Systems

In this paper, we investigate how model-driven engineering (MDE) of Internet of Things (IoT) systems and Wireless-Sensor Networks (WSN) can be supported and introduce a domain-specific metamodel for modeling such systems based on the well-known Contiki operating system. The unique lightweight thread structure of Contiki makes it more preferable in the implementation of new IoT systems instead of many other existing platforms. Although some MDE approaches exist for IoT systems and WSNs, currently there is no study which addresses the modelling according to the specifications of Contiki platform. The work presented in this paper aims at filling this gap and covers the development of both a modeling language syntax and a graphical modeling environment for the MDE of IoTs according to event-driven mechanism and protothread architecture of Contiki. Use of the proposed modeling language is demonstrated with including the development of an IoT system for forest fire detection

An Asynchronous Self-Stabilizing Maximal Independent Set Algorithm in Wireless Sensor Networks Using Two-Hop Information

International Symposium on Networks, Computers and Communications (ISNCC) -- JUN 18-20, 2019 -- Istanbul, TURKEYArapoglu, Ozkan/0000-0001-7309-7948WOS: 000520478600097Maximal independent set (MIS) has significantly important in practical applications for wireless sensor networks (WSNs). A distributed self-stabilizing system can initially start at any illegal state and takes back a legal state as long as there is no external intervention. We propose a novel distributed self-stabilizing MIS algorithm using two-hop information. It stabilizes an unstable system at most n-1 moves under an unfair distributed scheduler where n is the number of nodes in the graph. We use the message passing model as the communication model where this model is very appropriate for WSNs. the communication consumes the most energy in WSNs. So, move count is at least as important as round count where reducing the move count prolongs the lifetime of the network. We analyzed theoretically and tested it on SimPy discrete event simulator on randomly generated connected simple undirected graphs to compare with its counterparts in terms of transmitted bit count and move count against various node degrees and node counts.IEEE, IEEE Commun Soc, TEST, CIS ARGE, AI

Experimental Evaluation of Synchronous Distributed Dominating Set Algorithms

27th Signal Processing and Communications Applications Conference (SIU) -- APR 24-26, 2019 -- Sivas Cumhuriyet Univ, Sivas, TURKEYWOS: 000518994300166Dominating sets are one of the most important graph theoretic structures used in clustering and routing protocols in wireless sensor networks. For this reason, many distributed dominating set algorithms have been studied by researchers. Since wireless sensor networks are usually composed of battery powered devices, it is important to minimize the resource consumption of dominating set algorithms. in this study, experimental performance of four synchronous distributed dominating set algorithms including 1-hop span-based, 2-hop span-based, random and identity (ID)-based are measured in SimPy environment in terms of time, message, cluster size and energy per node. While performing these tests, the node count and the average node degree in the wireless sensor networks are changed and a large number of measurements are taken to compare the algorithms. As a result of the detailed experiments, 2-hop span-based algorithm has the best results in terms of set size and the ID-based algorithm has the best results in terms of resource utilization.IEEE Turkey Sect, Turkcell, Turkhavacilik Uzaysanayii, Turitak Bilgem, Gebze Teknik Univ, SAP, Detaysoft, NETAS, Havelsa

A Fully Distributed Fault-Tolerant Cluster Head Selection Algorithm for Unit Disk Graphs

International Symposium on Networks, Computers and Communications (ISNCC) -- JUN 18-20, 2019 -- Istanbul, TURKEYArapoglu, Ozkan/0000-0001-7309-7948WOS: 000520478600012Wireless ad hoc and sensor networks, one of the important components of the Internet of Things, consist of hundreds or even thousands of tiny sensor nodes without a fixed infrastructure. Due to lack of transmission power, the presence of obstacles, and other environmental conditions, ordinary sensor nodes that are powered from their batteries may have to send data in a multi-hop manner to the sink node. Therefore, it is very important to conduct an energy-efficient and fault-tolerant routing algorithm. Clustering is one of the most popular methods for routing in wireless sensor networks. With the help of clustering, nodes are classified as cluster leaders and ordinary nodes. in this study, a distributed, fault-tolerant cluster leader selection algorithm is proposed for a wireless sensor and ad hoc networks that can be modeled as a unit disk graph. the proposed algorithm is self-stabilized and it is based on a maximum independent set. the theoretical analysis of the proposed algorithm is performed, it is implemented in SimPy environment and compared with other algorithms. According to the measurements taken, the proposed algorithm performs significantly better than its counterparts.IEEE, IEEE Commun Soc, TEST, CIS ARGE, AIRTUBITAKTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [215E115]The authors thank TUBITAK for the project grant: 215E115

A fault-tolerant and distributed capacitated connected dominating set algorithm for wireless sensor networks

Energy efficiency is one of the major issues in wireless sensor networks (WSNs) that lack a fixed infrastructure and centralized control. In order to prolong the network lifetime, a connected dominating set (CDS) has been widely used as a virtual backbone in WSNs. The sensor nodes in WSNs are prone to failure due to a lack of battery, hardware damage, link failure, or environmental interference. Therefore, designing an energy-efficient and fault-tolerant CDS algorithm is quite vital in WSNs. A non-masking fault tolerance method denoted selfstabilizing tolerates any finite number of transient faults. In this paper, we propose a fault-tolerant distributed algorithm for a minimal capacitated CDS (CapCDS) construction in WSNs. To the best of our knowledge, this is (the first distributed self-stabilizing CapCDS algorithm. It makes an illegitimate system legitimate at most n2 3 + )2n moves by using an unfair distributed scheduler where n is the number of nodes. The performance of the algorithm is validated through extensive experimental testbeds and simulations.Scientific and Technological Research Council of Turkey (TUBITAK) [215E115]This work was funded by The Scientific and Technological Research Council of Turkey (TUBITAK) for the 215E115 numbered project